WORST_CASE(?,O(n^1))

Solution:
---------

  "activate" :: ["A"(15)] -(4)-> "A"(6)
  "c" :: ["A"(15)] -(12)-> "A"(6)
  "d" :: ["A"(6)] -(1)-> "A"(6)
  "f" :: ["A"(6)] -(14)-> "A"(6)
  "g" :: ["A"(0)] -(2)-> "A"(7)
  "h" :: ["A"(15)] -(15)-> "A"(1)
  "n__d" :: ["A"(15)] -(0)-> "A"(15)
  "n__d" :: ["A"(6)] -(0)-> "A"(6)
  "n__f" :: ["A"(15)] -(15)-> "A"(15)
  "n__f" :: ["A"(0)] -(0)-> "A"(0)
  "n__f" :: ["A"(6)] -(6)-> "A"(6)
  "n__g" :: ["A"(0)] -(0)-> "A"(15)
  "n__g" :: ["A"(0)] -(0)-> "A"(7)


Cost Free Signatures:
---------------------

  "activate" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "c" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "d" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "f" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "g" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "n__d" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "n__f" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "n__g" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"n__d\"_A" :: ["A"(0)] -(0)-> "A"(1)
  "\"n__f\"_A" :: ["A"(0)] -(1)-> "A"(1)
  "\"n__g\"_A" :: ["A"(0)] -(0)-> "A"(1)